منابع مشابه
On the Security of Ping-Pong Protocols
Consider the class of protocols, for two participants, in which the initiator applies a sequence of operators to a message M and sends it to the other participant ; in each step, one of the participants applies a sequence of operators to the message received last, and sends it back . This "ping-pong" action continues several times, using sequences of operators as specified by the protocol . The...
متن کاملMonotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols
Ping-pong protocols with recursive definitions of agents, but without any active intruder, are a Turing powerful model. We show that under the environment sensitive semantics (i.e. by adding an active intruder capable of storing all exchanged messages including full analysis and synthesis of messages) some verification problems become decidable. In particular we give an algorithm to decide cont...
متن کاملA Sufficient Condition for Secure Ping-Pong Protocols
A sufficient condition for secure ping–pong protocols is repretsented. This condition, called name– suffixing, is essentially to insert identities of participants in messages. We prove its sufficiency and discuss the feature of security in terms of name–suffixing.
متن کاملPing-Pong Protocols as Prefix Grammars and Turchin Relation
This paper describes how to verify cryptographic protocols by a general-purpose program transformation technique with unfolding. The questions of representation and analysis of the protocols as prefix rewriting grammars are discussed. In these aspects Higman and Turchin embeddings on computational paths are considered, and a refinement of Turchin’s relation is presented that allows to algorithm...
متن کاملVerification of Multi-Party Ping-Pong Protocols via Program Transformation
The paper describes a verification technique based on program transformation with unfolding. The technique allows to find short attacks on multi-party ping-pong protocols in the Dolev–Yao intruder model. Protocols are modelled by prefix grammars, and questions of model optimization and complexity are considered. Examples of model programs for protocols were written in a functional language and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 2003
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v10i47.21819